On randomized versus deterministic computation
نویسندگان
چکیده
منابع مشابه
Deterministic Versus Randomized Kaczmarz Iterative Projection
The Kaczmarz’s alternating projection method has been widely used for solving a consistent (mostly over-determined) linear system of equations Ax = b. Because of its simple iterative nature with light computation, this method was successfully applied in computerized tomography. Since tomography generates a matrix A with highly coherent rows, randomized Kaczmarz algorithm is expected to provide ...
متن کاملDeterministic versus randomized adaptive test cover
In a combinatorial search problem with binary tests, we are given a set of elements (vertices) and a hypergraph of possible tests (hyperedges), and the goal is to find an unknown target element using a minimum number of tests. We explore the expected test number of randomized strategies. Our main results are that the ratio of the randomized and deterministic test numbers can be logarithmic in t...
متن کاملRandomized versus Deterministic Implementations of Concurrent Data Structures
One of the key trends in computing over the past two decades has been increased distribution, both at the processor level, where multi-core architectures are now the norm, and at the system level, where many key services are currently distributed over multiple machines. Thus, understanding the power and limitations of computing in a concurrent, distributed setting is one of the major challenges...
متن کاملComputation on Randomized Data
Cryptographic tools, such as secure computation or homomorphic encryption, are very computationally expensive. This makes their use for confidentiality protection of client’s data against an untrusted service provider uneconomical in most applications of cloud computing. In this paper we present techniques for randomizing data using light-weight operations and then securely outsourcing the comp...
متن کاملComputation of Deterministic Volatility Surfaces
The `volatility smile' is one of the well-known biases of Black-Scholes models for pricing options. In this paper, we introduce a robust method of reducing this bias by pricing subject to a deterministic functional volatility = (S; t). This instantaneous volatility is chosen as a spline whose weights are determined by a regularised numerical strategy that approximately minimises the di erence b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00127-1